منابع مشابه
An upper bound on Jacobsthal's function
The function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to the first k primes. We give a new computational method for calculating strong upper bounds on h(k).
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملA computational upper bound on Jacobsthal’s function
The function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to the first k primes. We give a new computational method for calculating strong upper bounds on h(k).
متن کاملAn Upper Bound Analysis of Sandwich Sheet Rolling Process
In this research, flat rolling process of bonded sandwich sheets is investigated by the method of upper bound. A kinematically admissible velocity field is developed for a single layer sheet and is extended into the rolling of the symmetrical sandwich sheets. The internal, shear and frictional power terms are derived and they are used in the upper bound model. Through the analysis, the rolling ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2014
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2014-02896-2